Industrial Engineering and Computer Sciences Division (G2I) EVOLUTIONARY, CONSTRUCTIVE and HYBRID PROCEDURES FOR THE BIOBJECTIVE SET PACKING PROBLEM
نویسندگان
چکیده
The bi-objective set packing problem is a multi-objective combinatorial optimization problem similar to the well-known set covering/partitioning problems. To our knowledge, this problem has surprisingly not yet been studied. In order to resolve a practical problems encountered in railway infrastructure capacity planning, procedures for computing a solution to this bi-objective combinatorial problem were investigated. Unfortunately, solving the problem exactly in a reasonable time using a generic solver (Cplex) is only possible for small instances. We designed three alternative procedures approximating solutions to this problem. The first is based on version 1 of the ‘Strength Pareto Evolutionary Algorithm’, which is a population based-metaheuristic. The second is an adaptation of the ‘Greedy Randomized Adaptative Search Procedure’, which is a constructive metaheuristic. As underlined in the overview of the literature summarized here, almost all the recent, effective procedures designed for approximating optimal solutions to multi-objective combinatorial optimization problems are based on a blend of techniques, called hybrid metaheuristics. Thus, the third alternative, which is the primary subject of this paper, is an original hybridization of the previous two metaheuristics. The algorithmic aspects, which differ from the original definition of these metaheuristics, are described, so that our results can be reproduced. The performance of our procedures is reported and the computational results for 120 numerical instances are discussed.
منابع مشابه
A new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملIndustrial Engineering and Computer Sciences Division (G2I) DECISION MAKING AND SUPPORT TOOLS FOR DESIGN OF MACHINING SYSTEMS
متن کامل
Industrial Engineering and Computer Sciences Division (G2I) IMPROVEMENT IN SOLVING BALANCING PROBLEMS FOR MACHINING TRANSFER LINES WITH BLOCKS OF PARALLEL OPERATIONS
In the volume 38 of IIE Transactions (2006), Dolgui et al. introduced a line balancing problem in the machining environment, characterized by a number of particularities in comparison with the well-studied assembly line balancing problem, for example, parameterized operation times, non-strict precedence constraints and simultaneous operations performing. An exact method based on MIP formulation...
متن کاملImproving of Feature Selection in Speech Emotion Recognition Based-on Hybrid Evolutionary Algorithms
One of the important issues in speech emotion recognizing is selecting of appropriate feature sets in order to improve the detection rate and classification accuracy. In last studies researchers tried to select the appropriate features for classification by using the selecting and reducing the space of features methods, such as the Fisher and PCA. In this research, a hybrid evolutionary algorit...
متن کاملIndustrial Engineering and Computer Sciences Division (G2I) AN INTEGER PROGRAMMING MODEL FOR LOGICAL LAYOUT DESIGN OF MODULAR MACHINING LINES
The problem of designing a modular manufacturing lines is addressed. The modules are multi-spindle units and each unit executes simultaneously a subset of operations. This paper presents an approach to select the right spindle units and to arrange them into linear workstations. Our objective is to design such lines respecting technological constraints by minimizing the investment cost, which ta...
متن کامل